Manipulation of Optimal Matchings via Predonation of Endowment ∗ July 2003
نویسندگان
چکیده
In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.
منابع مشابه
Manipulation of optimal matchings via predonation of endowment
In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.
متن کاملPlanning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions
This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملSemi-matchings for Bipartite Graphs and Load Balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it is a relaxation of the known bipartite matching problem. We present a way to evaluate the quality of a given semi-matching and show that, under this measure, an optimal semi-matching balances the load on the right han...
متن کاملStrategyproof Matching with Minimum Quotas and Initial Endowments: (Extended Abstract)
Although minimum quotas are important in many real-world markets, existing strategyproof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategyproof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student c...
متن کامل